Elements of Dynamic Programming in Sorting

Dynamic programming is an effective algorithm design method. Sorting is believed to be an unusual area for dynamic programming. Our finding is contrary to this conventional belief. Though it appears that classical sorting algorithms were designed using bottom up design approach, but we have found the evidence which suggests that some classical sorting algorithms can also be designed using Dynamic programming design method. Even the development of classical Merge algorithm shows elements of dynamic programming. This paper finds that development of sorting algorithms can be looked from an entirely different point of view. This work will reveal some new facts about the design or development of some key sorting algorithms. It was discovered that this new interpretation gives a deep insight about the design of some fundamental sorting algorithms.